一阶时超微分方程解的零点分布

利用一类新的迫近数列,讨论了一阶时超微分方程解的零点分布.     

含连续滞量和阻尼项的非线性双曲偏微分方程组的振动性

研究了一类含连续分布滞量和阻尼项的非线性双曲型偏微分方程组运用黎卡提变换获得了该方程组在两类边值条件下解振动的充分条件.     

Positive solutions of Neumann problems with singularities

In this paper, we study the existence of positive solutions to second order singular equations with Neumann boundary conditions. The proof of the main result relies on a nonlinear alternative principle of Leray-Schauder, together with a truncation technique.     

Numerical simulations of the steady Navier–Stokes equations using adaptive meshing schemes

In this paper, we consider an adaptive meshing scheme for solution of the steady incompressible Navier–Stokes equations by finite element discretization. The mesh refinement and optimization are performed based on an algorithm that combines the so‐called conforming centroidal Voronoi Delaunay triangulations (CfCVDTs) and residual‐type local a posteriori error estimators. Numerical experiments in the two‐dimensional space for various examples are presented with quadratic finite elements used for the velocity field and linear finite elements for the pressure. The results show that our meshing scheme can equally distribute the errors over all elements in some optimal way and keep the triangles very well shaped as well at all levels of refinement. In addition, the convergence rates achieved are close to the best obtainable. Extension of this approach to three‐dimensional cases is also discussed and the main challenge is the efficient implementation of three‐dimensional CfCVDT generation that is still under development. Copyright © 2007 John Wiley & Sons, Ltd.     

On the vanishing viscosity method for first order differential-functional IBVP

We consider the initial-boundary value problem for first order differential-functional equations. We present the ‘vanishing viscosity’ method in order to obtain viscosity solutions. Our formulation includes problems with a retarded and deviated argument and differential-integral equations. Supported by KBN grant 2 PO3A, 01811.     

Constructing all magic squares of order three

We find by applying MacMahon's partition analysis that all magic squares of order three, up to rotations and reflections, are of two types, each generated by three basis elements. A combinatorial proof of this fact is given.     

Abstract Volterra operators

We propose a new general definition of Volterra operators. Several types of evolutionary operators, including Volterra ones in the sense of A.N. Tikhonov, satisfy this definition. For equations with generalized Volterra operators we introduce the notions of local, global, and maximally extended solutions. For solutions to nonlinear equations we formulate the existence, uniqueness, and extendability conditions. The theorems proved in this paper imply both known and new results on the solvability of concrete equations. We adduce an example of the application of obtained results to the study of the Cauchy problem for functional differential equations.     

Convergence of the Magnus Series

The Magnus series is an infinite series which arises in the study of linear ordinary differential equations. If the series converges, then the matrix exponential of the sum equals the fundamental solution of the differential equation. The question considered in this paper is: When does the series converge? The main result establishes a sufficient condition for convergence, which improves on several earlier results.     

On the resolution and optimization of a system of fuzzy relational equations with sup-T composition

This paper provides a thorough investigation on the resolution of a finite system of fuzzy relational equations with sup-T composition, where T is a continuous triangular norm. When such a system is consistent, although we know that the solution set can be characterized by a maximum solution and finitely many minimal solutions, it is still a challenging task to find all minimal solutions in an efficient manner. Using the representation theorem of continuous triangular norms, we show that the systems of sup-T equations can be divided into two categories depending on the involved triangular norm. When the triangular norm is Archimedean, the minimal solutions correspond one-to-one to the irredundant coverings of a set covering problem. When it is non-Archimedean, they only correspond to a subset of constrained irredundant coverings of a set covering problem. We then show that the problem of minimizing a linear objective function subject to a system of sup-T equations can be reduced into a 0–1 integer programming problem in polynomial time. This work generalizes most, if not all, known results and provides a unified framework to deal with the problem of resolution and optimization of a system of sup-T equations. Further generalizations and related issues are also included for discussion.     

Analysis of a particle method for the one‐dimensional Vlasov‐Maxwell system

In this article we present a particle method for solving numerically the one‐dimensional Vlasov‐Maxwell equations. This method is based on the formulation by characteristics. We perform the error analysis and we investigate the properties of this scheme. © 2008 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2009